Solving Parity Games on Integer Vectors
نویسندگان
چکیده
We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity games on vector addition systems with states (VASS) and multidimensional energy parity games. We show that the multidimensional energy parity game problem is inter-reducible with a subclass of singlesided parity games on VASS where just one player can modify the integer counters and the opponent can only change control-states. Our main result is that the minimal elements of the upward-closed winning set of these single-sided parity games on VASS are computable. This implies that the Pareto frontier of the minimal initial credit needed to win multidimensional energy parity games is also computable, solving an open question from the literature. Moreover, our main result implies the decidability of weak simulation preorder/equivalence between finite-state systems and VASS, and the decidability of model checking VASS with a large fragment of the modal μ-calculus.
منابع مشابه
Mean-Payoff Games and the Max-Atom Problem
The max-atom problem asks for the satisfiability of a system of inequality constraints of the type x ≤ max(y, z) + c, where x, y and z are integer variables, and c is an integer constant. We observe that this problem is polynomial-time equivalent to solving mean-payoff games, and therefore at least as hard as solving parity games.
متن کاملPrecise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showing that precise interval analysis is at least as hard as computing the sets of winning positions in parity games. Our lower-bound proof relies on an encoding of parity games into systems of particular integer equations...
متن کاملSolving parity games by a reduction to SAT
This paper presents a reduction from the problem of solving parity games to the satisfiability problem in propositional logic (SAT). The reduction is done in two stages, first into difference logic, i.e. SAT combined with the theory of integer differences, an instance of the SAT modulo theories (SMT) framework. In the second stage the integer variables and constraints of the difference logic en...
متن کاملComputing Game Values for Crash Games
We consider crash games which are a generalization of parity games in which the play value of a play is an integer, −∞ or ∞. In particular, the play value of a finite play is given as the sum of the payoffs of the moves of the play. Accordingly, one player aims at maximizing the play value whereas the other player aims at minimizing this value. We show that the game value of such a crash game a...
متن کاملPreprocessing parity games with partial Gauss elimination
We investigate the use of partial Gauss elimination as a preprocessing step to parity game solving. Gauss elimination is a well-known technique for solving Boolean equation systems. We present an Θ(V ) time algorithm for exhaustive partial Gauss elimination on parity games. Experimental validation shows that this approach is probably not feasible for speeding up the solving of real-world parity...
متن کامل